package leetcode.D1000.T986;

import util.GraphUtil;

/**
 * @File Info: leetcode -- <M986>
 * @Author: 18362
 * @Create: 2022-02-24 14:56:33 星期四
 */
public class M986 {
    public static void main(String[] args) {
        int[][] firstList = GraphUtil.parseGraph("[[1,7]]");
        int[][] secondList = GraphUtil.parseGraph("[[3,10]]");
        int[][] results = new Solution().intervalIntersection(firstList, secondList);
        GraphUtil.printGraph(results);
    }
}
